Comparative Study of Weighted Clustering Algorithms for Mobile Ad Hoc Networks

نویسنده

  • S. Aruna
چکیده

Routing in MANET is different from routing in wired network. One way to reduce routing overhead is to divide the network into clusters. Clustering of nodes into groups efficiently minimizes routing traffic overhead. Several algorithms have been proposed by researchers for formation of clusters and election of cluster heads. Most of the algorithms consider only one performance factor such as node-id, or mobility or node degree, or energy etc., for the election of cluster head. But considering only one performance factor for electing cluster head may result in performance degradation of the network. But, recently, some works has been done by considering number of performance factors for finding the quality of nodes as cluster heads. This paper presents a review on the comparison of single metric and multiple metric based clustering algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determining Cluster-Heads in Mobile Ad-Hoc Networks Using Multi-Objective Evolutionary based Algorithm

A mobile ad-hoc network (MANET), a set of wirelessly connected sensor nodes, is a dynamic system that executes hop-by-hop routing independently with no external help of any infrastructure. Proper selection of cluster heads can increase the life time of the Ad-hoc network by decreasing the energy consumption. Although different methods have been successfully proposed by researchers to tackle...

متن کامل

Determining Cluster-Heads in Mobile Ad-Hoc Networks Using Multi-Objective Evolutionary based Algorithm

A mobile ad-hoc network (MANET), a set of wirelessly connected sensor nodes, is a dynamic system that executes hop-by-hop routing independently with no external help of any infrastructure. Proper selection of cluster heads can increase the life time of the Ad-hoc network by decreasing the energy consumption. Although different methods have been successfully proposed by researchers to tackle...

متن کامل

ADAPTIVE ORDERED WEIGHTED AVERAGING FOR ANOMALY DETECTION IN CLUSTER-BASED MOBILE AD HOC NETWORKS

In this paper, an anomaly detection method in cluster-based mobile ad hoc networks with ad hoc on demand distance vector (AODV) routing protocol is proposed. In the method, the required features for describing the normal behavior of AODV are defined via step by step analysis of AODV and independent of any attack. In order to learn the normal behavior of AODV, a fuzzy averaging method is used fo...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Design and evaluation of two scalable protocols for location management of mobile nodes in location based routing protocols in mobile Ad Hoc Networks

Heretofore several position-based routing protocols have been developed for mobile ad hoc networks. Many of these protocols assume that a location service is available which provides location information on the nodes in the network.Our solutions decrease location update without loss of query success rate or throughput and even increase those.Simulation results show that our methods are effectiv...

متن کامل

Survey of clustering techniques for mobile ad hoc networks Técnicas de agrupamiento para redes móviles ad hoc

Clustering methods allow fast connection and also better routing and topology management of mobile ad hoc networks (MANET). In this paper a survey of clustering techniques for MANET is presented and some preliminary concepts for designing clustering algorithms are introduced. These concepts relate to network topology, routing schemes, graph partitioning and mobility algorithms. In addition, som...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014